The classical granular temperature and slightly beyond

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond

The Gottesman-Knill theorem states that every “Clifford” quantum circuit, i.e., a circuit composed of Hadamard, CNOT and phase gates, can be simulated efficiently on a classical computer. It is was later found that a highly restricted classical computer (using only NOT and CNOT gates) suffices to simulate all Clifford circuits, implying that these circuits are most likely even significantly wea...

متن کامل

Granular Gases Beyond the Dilute Limit

• Dynamics of Sheared Granular Fluid Meheboob Alam In first part of this talk, I will briefly review the dynamics of sheared granular fluid, focusing on instabilities, patterns and bifurcations in plane shear flow. It is shown that a universal criterion holds for the onset of the shear-banding instability (for perturbations having no variation along the stream-wise direction), that lead to shea...

متن کامل

Efficient classical simulation of slightly entangled quantum computations.

We present a classical protocol to efficiently simulate any pure-state quantum computation that involves only a restricted amount of entanglement. More generally, we show how to classically simulate pure-state quantum computations on n qubits by using computational resources that grow linearly in n and exponentially in the amount of entanglement in the quantum computer. Our results imply that a...

متن کامل

Slightly Beyond Turing's Computability for Studying Genetic Programming

Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tricks from GP and also provides complexity lower-bounds which justify the computational cost of GP thanks to the use of Kolmogorov’s complexity in bounded time.

متن کامل

Schreier rewriting beyond the classical setting

Using actions of the free monoids and free associative algebras, we establish some Schreier-type formulas involving the ranks of actions and the ranks of subactions in free actions or Grassmann-type relations for the ranks of intersections of subactions of free actions. The coset action of the free group is used to establish the generalization of the Schreier formula to the case of subgroups of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Powder Technology

سال: 2008

ISSN: 0032-5910

DOI: 10.1016/j.powtec.2007.08.002